On security arguments of the second round SHA-3 candidates
نویسندگان
چکیده
منابع مشابه
Security Reductions of the Second Round SHA-3 Candidates
In 2007, the US National Institute for Standards and Technology announced a call for the design of a new cryptographic hash algorithm in response to vulnerabilities identified in existing hash functions, such as MD5 and SHA-1. NIST received many submissions, 51 of which got accepted to the first round. At present, 14 candidates are left in the second round. An important criterion in the selecti...
متن کاملStatistical Analysis of Reduced Round Compression Functions of SHA-3 Second Round Candidates
National Institute of Standards and Technology announced a competition in 2008, of which the winner will be acknowledged as the new hash standard SHA-3. There are 14 second round candidates which are selected among 51 first round algorithms. In this paper, we apply statistical analysis to the second round candidate algorithms by using two different methods, and observe how conservative the algo...
متن کاملProvable Security Analysis of SHA-3 Candidates
Hash functions are fundamental cryptographic primitives that compress messages of arbitrary length into message digests of a fixed length. They are used as the building block in many important security applications such as digital signatures, message authentication codes, password protection, etc. The three main security properties of hash functions are collision, second preimage and preimage r...
متن کاملSharing Resources Between AES and the SHA-3 Second Round Candidates Fugue and Grøstl
Four out of the 14 second round candidates of the NIST SHA-3 cryptographic hash algo rithm competition are so-called AES-inspired algorithms which share common structure and features with AES or even use it as a subroutine. This paper focuses on two of them, Fugue and Grøstl, and studies how efficiently logic can be shared in implementations combining them with AES. It will be shown that addin...
متن کاملHardware Implementations of the Round-Two SHA-3 Candidates: Comparison on a Common Ground
Hash functions are a core part of many protocols that are in daily use. Following recent results that raised concerns regarding the security of the current hash standards, the National Institute of Standards and Technology (NIST) pronounced a competition to find a new Secure Hash Algorithm (SHA), the SHA-3. An important criterion for the new standard is not only its security, but also the perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Security
سال: 2012
ISSN: 1615-5262,1615-5270
DOI: 10.1007/s10207-012-0156-7